The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
نویسندگان
چکیده
We show that in the c.e. weak truth table degrees if b < c then there is an a which contains no hypersimple set and b < a < c. We also show that for every w < c in the c.e. wtt degrees such that w is hypersimple, there is a hypersimple a such that w < a < c. On the other hand we know that there are intervals which contain no hypersimple set.
منابع مشابه
Hypersimplicity and semicomputability in the weak truth table degrees
We study the classes of hypersimple and semicomputable sets as well as their intersection in the weak truth table degrees. We construct degrees that are not bounded by hypersimple degrees outside any non-trivial upper cone of Turing degrees and show that the hypersimple-free c.e. wtt degrees are downwards dense in the c.e. wtt degrees. Moreover, we consider the sets that are both hypersimple an...
متن کاملOn minimal wtt-degrees and computably enumerable Turing degrees
Computability theorists have studied many different reducibilities between sets of natural numbers including one reducibility (≤1), many-one reducibility (≤m), truth table reducibility (≤tt), weak truth table reducibility (≤wtt) and Turing reducibility (≤T ). The motivation for studying reducibilities stronger that Turing reducibility stems from internally motivated questions about varying the ...
متن کاملStrengthening prompt simplicity
We introduce a natural strengthening of prompt simplicity which we call strong promptness, and study its relationship with existing lowness classes. This notion provides a ≤wtt version of superlow cuppability. We show that every strongly prompt c.e. set is superlow cuppable. Unfortunately, strong promptness is not a Turing degree notion, and so cannot characterize the sets which are superlow cu...
متن کاملEvery nonzero c . e . strongly bounded Turing degree has the anti - cupping property ∗
The strongly bounded Turing reducibilities r = cl (computable Lipschitz reducibility) and r = ibT (identity bounded Turing reducibility) are defined in terms of Turing reductions where the use function is bounded by the identity function up to an additive constant and the identity function, respectively. We show that, for r = ibT, cl, every computably enumerable (c.e.) r-degree a > 0 has the an...
متن کاملInterpreting N in the computably enumerable weak truth talble degrees
We give a rst-order coding without parameters of a copy of (N;+;) in the computably enumerable weak truth table degrees. As a tool,we develop a theory of parameter deenable subsets. Given a degree structure from computability theory, once the undecidability of its theory is known, an important further problem is the question of the actual complexity of the theory. If the structure is arithmetic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 47 شماره
صفحات -
تاریخ انتشار 2006